Putnam’s Resolving Maps in Dimension Zero
نویسنده
چکیده
A block code from an irreducible shift of finite type can be lifted canonically through resolving maps to a resolving map. There is an application to Markovian maps.
منابع مشابه
Adjacency metric dimension of the 2-absorbing ideals graph
Let Γ=(V,E) be a graph and W_(a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),… ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...
متن کاملOn strongly Jordan zero-product preserving maps
In this paper, we give a characterization of strongly Jordan zero-product preserving maps on normed algebras as a generalization of Jordan zero-product preserving maps. In this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly Jordan zero-product preserving maps are completely different. Also, we prove that the direct p...
متن کاملMean Dimension and Ah-algebras with Diagonal Maps
Mean dimension for AH-algebras with diagonal maps is introduced. It is shown that if a simple unital AH-algebra with diagonal maps has mean dimension zero, then it has strict comparison on positive elements. In particular, the strict order on projections is determined by traces. Moreover, a lower bound of the mean dimension is given in term of Toms’ comparison radius. Using classification resul...
متن کاملResolving Extensions of Finitely Presented Systems
In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y, f) is a finitely presented system, then there exists a Smale space (X,F ) and a u-resolving factor map π+ : X → Y . If the finitely presented system is transitive, then we show there is a canonical minimal u-resolving Smale space extension. Additionally, we s...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کامل